Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1

Q is empty.


QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

A(c(x1)) → A(b(x1))
A(c(x1)) → B(x1)
A(x1) → B(x1)
A(c(x1)) → A(a(b(x1)))

The TRS R consists of the following rules:

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP
      ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(x1)) → A(b(x1))
A(c(x1)) → B(x1)
A(x1) → B(x1)
A(c(x1)) → A(a(b(x1)))

The TRS R consists of the following rules:

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
QDP
          ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(x1)) → A(b(x1))
A(c(x1)) → A(a(b(x1)))

The TRS R consists of the following rules:

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(c(x1)) → A(b(x1)) at position [0] we obtained the following new rules:

A(c(b(x0))) → A(x0)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
QDP
              ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(b(x0))) → A(x0)
A(c(x1)) → A(a(b(x1)))

The TRS R consists of the following rules:

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(c(x1)) → A(a(b(x1))) at position [0] we obtained the following new rules:

A(c(y0)) → A(b(b(y0)))
A(c(b(x0))) → A(a(x0))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
QDP
                  ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(y0)) → A(b(b(y0)))
A(c(b(x0))) → A(a(x0))
A(c(b(x0))) → A(x0)

The TRS R consists of the following rules:

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(c(y0)) → A(b(b(y0))) at position [0] we obtained the following new rules:

A(c(b(x0))) → A(b(x0))
A(c(x0)) → A(x0)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
QDP
                      ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(b(x0))) → A(b(x0))
A(c(x0)) → A(x0)
A(c(b(x0))) → A(x0)
A(c(b(x0))) → A(a(x0))

The TRS R consists of the following rules:

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(c(b(x0))) → A(b(x0)) at position [0] we obtained the following new rules:

A(c(b(b(x0)))) → A(x0)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
QDP
                          ↳ QDPToSRSProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(b(b(x0)))) → A(x0)
A(c(x0)) → A(x0)
A(c(b(x0))) → A(a(x0))
A(c(b(x0))) → A(x0)

The TRS R consists of the following rules:

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The finiteness of this DP problem is implied by strong termination of a SRS due to [12].


↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
QTRS
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1
A(c(b(b(x0)))) → A(x0)
A(c(x0)) → A(x0)
A(c(b(x0))) → A(a(x0))
A(c(b(x0))) → A(x0)

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1
A(c(b(b(x0)))) → A(x0)
A(c(x0)) → A(x0)
A(c(b(x0))) → A(a(x0))
A(c(b(x0))) → A(x0)

The set Q is empty.
We have obtained the following QTRS:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
QTRS
                                  ↳ DependencyPairsProof
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

C(a(x)) → C(c(x))
C(a(x)) → C(x)
A1(x) → B(x)
C(a(x)) → A1(c(c(c(x))))
C(a(x)) → C(c(c(x)))
B(c(A(x))) → A1(A(x))
C(a(x)) → A1(a(c(c(c(x)))))
C(a(x)) → B(a(a(c(c(c(x))))))

The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
QDP
                                      ↳ DependencyGraphProof
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(x)) → C(c(x))
C(a(x)) → C(x)
A1(x) → B(x)
C(a(x)) → A1(c(c(c(x))))
C(a(x)) → C(c(c(x)))
B(c(A(x))) → A1(A(x))
C(a(x)) → A1(a(c(c(c(x)))))
C(a(x)) → B(a(a(c(c(c(x))))))

The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 3 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                    ↳ QDP
                                      ↳ DependencyGraphProof
                                        ↳ AND
QDP
                                            ↳ UsableRulesProof
                                            ↳ UsableRulesProof
                                          ↳ QDP
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A1(x) → B(x)
B(c(A(x))) → A1(A(x))

The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                    ↳ QDP
                                      ↳ DependencyGraphProof
                                        ↳ AND
                                          ↳ QDP
                                            ↳ UsableRulesProof
QDP
                                            ↳ UsableRulesProof
                                          ↳ QDP
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A1(x) → B(x)
B(c(A(x))) → A1(A(x))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                    ↳ QDP
                                      ↳ DependencyGraphProof
                                        ↳ AND
                                          ↳ QDP
                                            ↳ UsableRulesProof
                                            ↳ UsableRulesProof
QDP
                                                ↳ UsableRulesReductionPairsProof
                                          ↳ QDP
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A1(x) → B(x)
B(c(A(x))) → A1(A(x))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the usable rules with reduction pair processor [15] with a polynomial ordering [25], all dependency pairs and the corresponding usable rules [17] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.

The following dependency pairs can be deleted:

B(c(A(x))) → A1(A(x))
No rules are removed from R.

Used ordering: POLO with Polynomial interpretation [25]:

POL(A(x1)) = x1   
POL(A1(x1)) = x1   
POL(B(x1)) = x1   
POL(c(x1)) = 1 + 2·x1   



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                    ↳ QDP
                                      ↳ DependencyGraphProof
                                        ↳ AND
                                          ↳ QDP
                                            ↳ UsableRulesProof
                                            ↳ UsableRulesProof
                                              ↳ QDP
                                                ↳ UsableRulesReductionPairsProof
QDP
                                                    ↳ DependencyGraphProof
                                          ↳ QDP
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A1(x) → B(x)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                    ↳ QDP
                                      ↳ DependencyGraphProof
                                        ↳ AND
                                          ↳ QDP
QDP
                                            ↳ Narrowing
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(x)) → C(c(x))
C(a(x)) → C(x)
C(a(x)) → C(c(c(x)))

The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(a(x)) → C(c(x)) at position [0] we obtained the following new rules:

C(a(A(x0))) → C(A(x0))
C(a(a(x0))) → C(b(a(a(c(c(c(x0)))))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                    ↳ QDP
                                      ↳ DependencyGraphProof
                                        ↳ AND
                                          ↳ QDP
                                          ↳ QDP
                                            ↳ Narrowing
QDP
                                                ↳ DependencyGraphProof
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(x)) → C(x)
C(a(A(x0))) → C(A(x0))
C(a(x)) → C(c(c(x)))
C(a(a(x0))) → C(b(a(a(c(c(c(x0)))))))

The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                    ↳ QDP
                                      ↳ DependencyGraphProof
                                        ↳ AND
                                          ↳ QDP
                                          ↳ QDP
                                            ↳ Narrowing
                                              ↳ QDP
                                                ↳ DependencyGraphProof
QDP
                                                    ↳ Narrowing
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(x)) → C(x)
C(a(x)) → C(c(c(x)))
C(a(a(x0))) → C(b(a(a(c(c(c(x0)))))))

The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(a(x)) → C(c(c(x))) at position [0] we obtained the following new rules:

C(a(A(x0))) → C(c(A(x0)))
C(a(a(x0))) → C(c(b(a(a(c(c(c(x0))))))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                    ↳ QDP
                                      ↳ DependencyGraphProof
                                        ↳ AND
                                          ↳ QDP
                                          ↳ QDP
                                            ↳ Narrowing
                                              ↳ QDP
                                                ↳ DependencyGraphProof
                                                  ↳ QDP
                                                    ↳ Narrowing
QDP
                                                        ↳ Narrowing
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(x)) → C(x)
C(a(a(x0))) → C(c(b(a(a(c(c(c(x0))))))))
C(a(A(x0))) → C(c(A(x0)))
C(a(a(x0))) → C(b(a(a(c(c(c(x0)))))))

The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(a(A(x0))) → C(c(A(x0))) at position [0] we obtained the following new rules:

C(a(A(x0))) → C(A(x0))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                    ↳ QDP
                                      ↳ DependencyGraphProof
                                        ↳ AND
                                          ↳ QDP
                                          ↳ QDP
                                            ↳ Narrowing
                                              ↳ QDP
                                                ↳ DependencyGraphProof
                                                  ↳ QDP
                                                    ↳ Narrowing
                                                      ↳ QDP
                                                        ↳ Narrowing
QDP
                                                            ↳ DependencyGraphProof
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(x)) → C(x)
C(a(A(x0))) → C(A(x0))
C(a(a(x0))) → C(c(b(a(a(c(c(c(x0))))))))
C(a(a(x0))) → C(b(a(a(c(c(c(x0)))))))

The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                    ↳ QDP
                                      ↳ DependencyGraphProof
                                        ↳ AND
                                          ↳ QDP
                                          ↳ QDP
                                            ↳ Narrowing
                                              ↳ QDP
                                                ↳ DependencyGraphProof
                                                  ↳ QDP
                                                    ↳ Narrowing
                                                      ↳ QDP
                                                        ↳ Narrowing
                                                          ↳ QDP
                                                            ↳ DependencyGraphProof
QDP
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(x)) → C(x)
C(a(a(x0))) → C(c(b(a(a(c(c(c(x0))))))))
C(a(a(x0))) → C(b(a(a(c(c(c(x0)))))))

The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We have reversed the following QTRS:
The set of rules R is

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

The set Q is empty.
We have obtained the following QTRS:

a(x) → b(x)
a(c(x)) → c(c(c(a(a(b(x))))))
b(b(x)) → x
A(c(b(b(x)))) → A(x)
A(c(x)) → A(x)
A(c(b(x))) → A(a(x))
A(c(b(x))) → A(x)

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                  ↳ QTRS Reverse
QTRS
                                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → b(x)
a(c(x)) → c(c(c(a(a(b(x))))))
b(b(x)) → x
A(c(b(b(x)))) → A(x)
A(c(x)) → A(x)
A(c(b(x))) → A(a(x))
A(c(b(x))) → A(x)

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x
b(b(c(A(x)))) → A(x)
c(A(x)) → A(x)
b(c(A(x))) → a(A(x))
b(c(A(x))) → A(x)

The set Q is empty.
We have obtained the following QTRS:

a(x) → b(x)
a(c(x)) → c(c(c(a(a(b(x))))))
b(b(x)) → x
A(c(b(b(x)))) → A(x)
A(c(x)) → A(x)
A(c(b(x))) → A(a(x))
A(c(b(x))) → A(x)

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ Narrowing
                        ↳ QDP
                          ↳ QDPToSRSProof
                            ↳ QTRS
                              ↳ QTRS Reverse
                                ↳ QTRS
                                  ↳ DependencyPairsProof
                                  ↳ QTRS Reverse
                                  ↳ QTRS Reverse
QTRS
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → b(x)
a(c(x)) → c(c(c(a(a(b(x))))))
b(b(x)) → x
A(c(b(b(x)))) → A(x)
A(c(x)) → A(x)
A(c(b(x))) → A(a(x))
A(c(b(x))) → A(x)

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1

The set Q is empty.
We have obtained the following QTRS:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
QTRS
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(x1) → b(x1)
a(c(x1)) → c(c(c(a(a(b(x1))))))
b(b(x1)) → x1

The set Q is empty.
We have obtained the following QTRS:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse
QTRS

Q restricted rewrite system:
The TRS R consists of the following rules:

a(x) → b(x)
c(a(x)) → b(a(a(c(c(c(x))))))
b(b(x)) → x

Q is empty.